General canonical models for graded normal logics (graded modalities IV)
نویسنده
چکیده
We prove the canonical models introduced in [D] do not exist for some graded normal logics with symmetric models, namely KB ~ KBD ~ KBT ~ so that we define a new kind of canonical models, the general ones, and show they exist and work well in every case.
منابع مشابه
F . N ESCO Graded Modalities , II
This work intends to be a generalization and a simplification oI me tecm~,~=~o employed in [2], by the proposal of a general strategy to prove satisfiability theorems for NLGM-s ( normal logics with graded modalities), analogously to the well known technique of the canonical models by Lemmon and Scott for classical modal logics.
متن کاملDecidability by Filtrations for graded normal logics (graded modalities V)
1. I n t r o d u c t i o n Graded normal logics ( G N L s ) are the extensions of modal normal logics to a language with graded modalities. The interpretation in usual Kripke models of a formula <>hA (n < w), whose main operator is a graded possibility, is there are more than n accessible worlds where A is true. When graded modalities were introduced (in [7], independently rediscovering a forme...
متن کاملModifier Logics Based on Graded Modalities
Modifier logics are considered as generalizations of "classiea1" modal logics. Thus modifier logics are soeanled multimodal logios. Multimodality means here that the basic logics are modal logics with graded modalities. The interpretation of modal operators is more generan, too. Leibniz's mottvating semantical ideas (see [8]. p. 20-21) givejustification to these generalizations. Semantics of ca...
متن کاملAn Infinitary Graded Modal Logic (Graded Modalities VI)
We prove a completeness theorem for K:l, the infinitary extension of the graded version K O of the minimal normal logic K , allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic. Mathematics Subject ...
متن کاملThe Complexity of the Graded µ-Calculus
In classical logic, existential and universal quantifiers express that there exists at least one individual satisfying a formula, or that all individuals satisfy a formula. In many logics, these quantifiers have been generalized to express that, for a non-negative integer , at least individuals or all but individuals satisfy a formula. In modal logics, graded modalities generalize standard exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 49 شماره
صفحات -
تاریخ انتشار 1990